Density Evolution for Asymmetric Memoryless Channels
نویسندگان
چکیده
منابع مشابه
Density Evolution for Asymmetric Memoryless Channels: The Perfect Projection Condition and the Typicality of the Linear LDPC Code Ensemble
Density evolution is one of the most powerful analytical tools for low-density parity-check (LDPC) codes and graph codes with message passing decoding algorithms. With channel symmetry as one of its fundamental assumptions, density evolution has been widely and successfully applied to different channels, including binary erasure channels, binary symmetric channels, binary additive white Gaussia...
متن کاملCommitment Capacity of Discrete Memoryless Channels
In extension of the bit commitment task and following work initiated by Crépeau and Kilian, we introduce and solve the problem of characterising the optimal rate at which a discrete memoryless channel can be used for bit commitment. It turns out that the answer is very intuitive: it is the maximum equivocation of the channel (after removing trivial redundancy), even when unlimited noiseless bid...
متن کاملPerformance of the verification for binary memoryless channels
We consider the verification problem when the verifier receives a pair of binary vectors (a, b) and makes the acceptance or the rejection decision. The acceptance decision has to be made if the vector b is the result of transmission of the vector a over a knownmemoryless channel. An attacker substitutes a vector b generated by a stationary Bernoulli source. We design the verification algorithm ...
متن کاملUniversal decoding for memoryless Gaussian channels with a deterministic interference
A universal decoding procedure is proposed for memoryless Gaussian channels with deterministic interfering signals from a certain class. The universality of the proposed decoder is in the sense of W i g independent of the channel parameters and the unknown interfering signal, and at the same time attaining the same random coding e m r exponent as the optimal maximum likelihood (ML) decoder, whi...
متن کاملCoding and decoding for time-discrete amplitude-continuous memoryless channels
In this report we consider some aspects of the general problem of encoding and decoding for time-discrete, amplitude-continuous memoryless channels. The results can be summarized under three main headings. 1. Signal Space Structure: A scheme for constructing a discrete signal space, for which sequential encoding-decoding methods are possible for the general continuous memoryless channel, is des...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2005
ISSN: 0018-9448
DOI: 10.1109/tit.2005.858931